Novel relay node placement algorithms for establishing connected topologies
نویسندگان
چکیده
منابع مشابه
A Novel Energy Efficient Relay Node Placement Approach for Wsn
Partitioning in wireless sensor network is an important aspect of research in wireless networks. Clusters or partitions in the network can be formed on the basis of either geographical area of the nodes or on the basis of some performance parameters. Also the nodes which form the cluster are either homogenous or heterogeneous in nature. In the proposed approach an objective function is proposed...
متن کاملproposing a novel algorithm for fault-tolerant relay node placement in wireless sensor networks
wireless sensor networks are composed of hundreds or thousands of small nodes called sensor that work together and are associated with a specific task or tasks to do. each of these nodes includes sensor, processor, communication components, a small memory and a source of energy. it is expected that wireless sensor networks will be used widely in many applications in near future. scalability and...
متن کاملNode Placement for Connected Coverage in Sensor Networks
We address the problem of optimal node placement for ensuring connected coverage in sensor networks. We consider two different practical scenarios. In the first scenario, a certain region (or a set of regions) are to be provided connected coverage, while in the second case, a given set of n points are to be covered and connected. For the first case, we provide solutions that are within a small ...
متن کاملEstablishing Norms for Network Topologies
In order to establish a norm in a society of agents, metanorms have previously been proposed as a means of ensuring not that norms are complied with, but that they are enforced. Yet while experimental results have shown that metanorms are effective in fully-connected environments such as that used by Axelrod, there has been limited consideration of such metanorm models with different but more r...
متن کاملImproved approximation algorithms for single-tiered relay placement
We consider the problem of Single-Tiered Relay Placement with Basestations, which takes as input a set S of sensors and a set B of basestations described as points in a normed space (M,d), and real numbers 0 < r ≤ R. The objective is to place a minimum cardinality set Q of wireless relay nodes that connects S and B according to the following rules. The sensors in S can communicate within distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Network and Computer Applications
سال: 2016
ISSN: 1084-8045
DOI: 10.1016/j.jnca.2016.04.025